Computing Character Degrees via a Galois Connection
نویسندگان
چکیده
In a previous paper, the second author established that, given finite fields F < E and certain subgroups C ≤ E×, there is a Galois connection between the intermediate field lattice {L | F ≤ L ≤ E} and C’s subgroup lattice. Based on the Galois connection, the paper then calculated the irreducible, complex character degrees of the semi-direct product C⋊Gal(E/F ). However, the analysis when |F | is a Mersenne prime is more complicated, so certain cases were omitted from that paper. The present exposition, which is a reworking of the previous article, provides a uniform analysis over all the families, including the previously undetermined ones. In the group C ⋊Gal(E/F), we use the Galois connection to calculate stabilizers of linear characters, and these stabilizers determine the full character degree set. This is shown for each subgroup C ≤ E× which satisfies the condition that every prime dividing |E× : C| divides |F×|.
منابع مشابه
Strong Connections and the Relative Chern-galois Character for Corings
The Chern-Galois theory is developed for corings or coalgebras over non-commutative rings. As the first step the notion of an entwined extension as an extension of algebras within a bijective entwining structure over a non-commutative ring is introduced. A strong connection for an entwined extension is defined and it is shown to be closely related to the Galois property and to the equivariant p...
متن کاملLagois Connections - a Counterpart to Galois Connections
In this paper we deene a Lagois connection, which is a generalization of a special type of Galois connection. We begin by introducing two examples of Lagois connections. We then recall the deenition of Galois connection and some of its properties; next we deene Lagois connection, establish some of its properties, and compare these with properties of Galois connections; and then we (further) dev...
متن کاملCausally Consistent Dynamic Slicing
We offer a lattice-theoretic account of dynamic slicing for π-calculus, building on prior work in the sequential setting. For any run of a concurrent program, we exhibit a Galois connection relating forward slices of the start configuration to backward slices of the end configuration. We prove that, up to lattice isomorphism, the same Galois connection arises for any causally equivalent executi...
متن کاملExtension of Fuzzy Galois Connection for Information Retrieval using a Fuzzy Quantifier
In information retrieval, the uncertain implication D −→ RQ has been different logical status. In this paper, we propose another way to consider this implication in fuzzy context. We introduce a logical formulation based on logical consequence and an evaluation based on an extension of fuzzy Galois connection. The proposed matching function deals with different semantics associated with terms d...
متن کاملSafety of abstract interpretations for free, via logical relations and Galois connections
Algebraic properties of logical relations on partially ordered sets are studied. It is shown how to construct a logical relation that extends a collection of base Galois connections to a Galois connection of arbitrary higher-order type. “Theorems-for-free” is used to show that the construction ensures safe abstract interpretation of parametrically polymorphic functions. The properties are used ...
متن کامل